Translatability of schemas over restricted interpretations
نویسندگان
چکیده
منابع مشابه
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. In 2006, Lucas proved that there are rewrite systems that can be shown polynomially terminating by polynomial interpretations with real (algebraic) coefficients, but cannot be shown polynomially ...
متن کاملThe Logos Translatability Index
A serious problem for users of machine translation is estimating the suitability of a particular document for MT and, thus, the translation quality. The available utilities such as style and grammar checkers, well-formedness and readability measures have not proven sufficiently useful in this regard. Researchers at Logos Corporation therefore undertook a study of the feasibility of a translatab...
متن کاملAutomatic Rating of Machine Translatability
We describe a method for automatically rating the machine translatability of a sentence for various machine translation (MT) systems. The method requires that the MT system can bidirectionally translate sentences in both source and target languages. However, it does not require reference translations, as is usual for automatic MT evaluation. By applying this method to every component of a sente...
متن کاملOn Translatability of English Idioms
Is Chinese translation of English Idioms possible? This has been a topic of debate for a very long period of time. Many linguists and translators have dwelt on this problem in their books or articles. Some of the popular ideas about the problems of translatability of English Idioms will be introduced in this paper which aims at helping people know more about the translatability of English Idioms.
متن کاملUsing Matrix Interpretations over the Reals in Proofs of Termination
Matrix interpretations are a new kind of algebraic interpretations with interesting capabilities for proving termination of rewriting systems. Roughly speaking, a matrix interpretation for a !-ary symbol " is a linear expression #1$1+⋅ ⋅ ⋅+#!$!+#0 where the #1, . . . , #! are matrices of '×' natural numbers and the variables $1, . . . , $! (and also #0) represent '-tuples of natural numbers. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1974
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(74)80030-9